Is understanding reducible?
نویسندگان
چکیده
منابع مشابه
Optimizing FOL Reducible Query Answering: Understanding Performance Challenges
Semantic Web data management raises the challenge of answering queries under constraints (i.e., in the presence of implicit data). To bridge the gap between this extended setting and that of query evaluation provided by database engines, a reasoning step (w.r.t. the constraints) is necessary before query evaluation. A large and useful set of ontology languages enjoys FOL reducibility of query a...
متن کاملReducible and ∂-reducible Handle Additions
Let M be a simple 3-manifold with F a component of ∂M of genus at least two. For a slope α on F , we denote by M(α) the manifold obtained by attaching a 2-handle to M along a regular neighborhood of α on F . Suppose that α and β are two separating slopes on F such that M(α) and M(β) are reducible. Then the distance between α and β is at most 2. As a corollary, if g(F ) = 2, then there is at mos...
متن کاملAn ascorbate-reducible cytochrome b561 is localized in macrophage lysosomes.
Cytochromes b561 (Cyts b561) are a family of intrinsic membrane proteins involved in ascorbate-mediated transmembrane electron transport. The chromaffin granule Cyt b561 (CGCytb) is believed to transport electrons donated by extravesicular ascorbate (ASC) across the membrane to intravesicular monodehydroascorbate (MDA) supporting catecholamine synthesis in neuroendocrine tissues. Another isofor...
متن کاملPlanar Graph Coloring is not Self-Reducible, Assuming P != NP
We show that obtaining the lexicographically first four coloring of a planar graph is NP–hard. This shows that planar graph four-coloring is not self-reducible, assuming P 6= NP . One consequence of our result is that the schema of [JVV 86] cannot be used for approximately counting the number of four colorings of a planar graph. These results extend to planar graph k-coloring, for k ≥ 4. Resear...
متن کاملEvery Sequence Is Reducible to a Random One
Charles Bennett asked whether every infinite binary sequence can be obtained from an "incompressible" one by a Turing machine, He proved that this is the case for arithmetical sequences. The question has some philosophical interest because it permits us to view even very pathological sequences as the result of the combination of two relatively wellunderstood processes: the completely chaotic ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Inquiry
سال: 2018
ISSN: 0020-174X,1502-3923
DOI: 10.1080/0020174x.2018.1562379